Euclid Algorithm to find HCF


 
 
Concept Explanation
 

Euclid Algorithm to find HCF

Euclid Division Algorithm to Find HCF of More Than Two Numbers:

To find HCF of more than two numbers we will first apply Euclid Division Algorithm on two numbers and Hcf so obtained then grouped we the third number and so on.

Example: To find HCF of 12, 15 and 21

Solution: Find HCF of 12, 15

15= 12 X 1+ 3

12= 4 X 3 + 0

So HCF(15,12) is 3

Now, Find HCF of 3 and 21

21= 7 X 3 + 0

As remainder is zero

So HCF( 3, 21) = 3

Thus HCF of (12,15,21) = 3

 
Video Link - Have a look !!!
 
Language - English
 
 
 
Related Videos
Language - English


Students / Parents Reviews [20]